Remarks about the digits of integers

On Binary Representations of Integers with Digits

Güntzer and Paul introduced a number system with base 2 and digits −1, 0, 1 which is characterized by separating nonzero digits by at least one zero. We find an explicit formula that produces the digits of the expansion of an integer n which leads us to many generalized situations. Syntactical properties of such representations are also discussed. 1. A binary number system Integers n can be wri...

On the Sum of Digits of Some Sequences of Integers

Let b ≥ 2 be a fixed positive integer. We show for a wide variety of sequences {an}n=1 that for most n the sum of the digits of an in base b is at least cb log n, where cb is a constant depending on b and on the sequence. Our approach covers several integer sequences arising from number theory and combinatorics.

Some Remarks on Prime Factors of Integers

an investigation about the relationship between insurance lines and economic growth; the case study of iran

مطالعات قبلی بازار بیمه را به صورت کلی در نظر می گرفتند اما در این مطالعه صنعت بیمه به عنوان متغیر مستفل به بیمه های زندگی و غیر زندگی شکسته شده و هم چنین بیمه های زندگی به رشته های مختلف بیمه ای که در بازار بیمه ایران سهم قابل توجهی دارند تقسیم میشود. با استفاده از روشهای اقتصاد سنجی داده های برای دوره های 48-89 از مراکز ملی داده جمع آوری شد سپس با تخمین مدل خود بازگشتی برداری همراه با تعدادی ...

Approximate Polynomial GCD over Integers with Digits-wise Lattice

For the given coprime polynomials over integers, we change their coefficients slightly over integers so that they have a greatest common divisor (GCD) over integers. That is an approximate polynomial GCD over integers. There are only two algorithms known for this problem. One is based on an algorithm for approximate integer GCDs. The other is based on the well-known subresultant mapping and the...